Local Search Heuristics for the Rectangle Packing Problem with General Spatial Costs
نویسندگان
چکیده
The two dimensional rectangle packing problem (2RP) is to place a given set of rectangles in the plane without overlap so that the given cost function is minimized. The edges of rectangles are required to be vertical or horizontal. There are various options on the packing rules and objective functions, e.g., rotations are allowed or not, a bin of fixed size to which rectangles should be packed is given or not. The problem is known to be NP-hard in general, and hence a number of heuristic algorithms have been proposed in the literature [1, 2].
منابع مشابه
Local search algorithms for the rectangle packing problem with general spatial costs
The rectangle packing problem with general spatial costs is to pack given rectangles without overlap in the plane so that the maximum cost of the rectangles is minimized. This problem is very general, and various types of packing problems and scheduling problems can be formulated in this form. For this problem, we have previously presented local search algorithms using a pair of permutations of...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملHeuristics for the Rectangle Packing Problem
In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4-heuristic for the pallet loading problem. In addition to the general RPP we take also into account further restrictions which are o...
متن کاملA discrete particle swarm optimization algorithm with local search for a production-based two-echelon single-vendor multiple-buyer supply chain
This paper formulates a two-echelon single-producer multi-buyer supply chain model, while a single product is produced and transported to the buyers by the producer. The producer and the buyers apply vendor-managed inventory mode of operation. It is assumed that the producer applies economic production quantity policy, which implies a constant production rate at the producer. The operational pa...
متن کاملHeuristic approaches for the two- and three-dimensional knapsack packing problem
The maximum profit twoor three-dimensional knapsack packing problem asks to pack a maximum profit subset of some given rectangles or boxes into a larger rectangle or box of fixed dimensions. Items must be orthogonally packed, but no other restrictions are imposed to the problem. The problem could also be considered as a knapsack problem generalized to two or three dimensions. In this paper we p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001